By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Optimization

Table of Contents
Search This Issue
Volume 11, Issue 1, pp. 1-288

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Provably Good Global Routing of Integrated Circuits

T. Lengauer and M. Lügering

pp. 1-30

BibTeX  Abstract Full Text:  PDF

Constraint Qualifications for Semi-Infinite Systems of Convex Inequalities

Wu Li, Chandal Nahak, and Ivan Singer

pp. 31-52

BibTeX  Abstract Full Text:  PDF

Optimization of Discontinuous Functions: A Generalized Theory of Differentiation

Luc Moreau and Dirk Aeyels

pp. 53-69

BibTeX  Abstract Full Text:  PDF

On the Rate of Convergence of Optimal Solutions of Monte Carlo Approximations of Stochastic Programs

Alexander Shapiro and Tito Homem-de-Mello

pp. 70-86

BibTeX  Abstract Full Text:  PDF

Differential Stability of Two-Stage Stochastic Programs

Darinka Dentcheva and Werner Römisch

pp. 87-112

BibTeX  Abstract Full Text:  PDF

A New QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm For Inequality Constrained Optimization

Hou-Duo Qi and Liqun Qi

pp. 113-132

BibTeX  Abstract Full Text:  PDF

Convergence Analysis of Inexact Infeasible-Interior-Point Algorithms for Solving Linear Programming Problems

Janos Korzak

pp. 133-148

BibTeX  Abstract Full Text:  PDF

Auction Algorithms for Shortest Hyperpath Problems

R. De Leone and D. Pretolani

pp. 149-159

BibTeX  Abstract Full Text:  PDF

Calm Minima in Parameterized Finite-Dimensional Optimization

A. B. Levy

pp. 160-178

BibTeX  Abstract Full Text:  PDF

Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints

Amir Beck and Marc Teboulle

pp. 179-188

BibTeX  Abstract Full Text:  PDF

On a Generic Existence Result in Optimization

Alexander J. Zaslavski

pp. 189-198

BibTeX  Abstract Full Text:  PDF

A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems

Paul Armand, Jean Charles Gilbert, and Sophie Jan-Jégou

pp. 199-222

BibTeX  Abstract Full Text:  PDF

Some New Search Directions for Primal-Dual Interior Point Methods in Semidefinite Programming

Kim-Chuan Toh

pp. 223-242

BibTeX  Abstract Full Text:  PDF

A Note on the Augmented Hessian When the Reduced Hessian is Semidefinite

Kurt M. Anstreicher and Margaret H. Wright

pp. 243-253

BibTeX  Abstract Full Text:  PDF

Eigenvalue Bounds Versus Semidefinite Relaxations for the Quadratic Assignment Problem

K. M. Anstreicher

pp. 254-265

BibTeX  Abstract Full Text:  PDF

Multiple Cuts in the Analytic Center Cutting Plane Method

Jean-Louis Goffin and Jean-Philippe Vial

pp. 266-288

BibTeX  Abstract Full Text:  PDF